Solving time-dependent heat conduction problems using metaheuristic algorithms extended with a novel local search strategy

نویسندگان

چکیده

Abstract This study proposes a novel and dexterous local search scheme for improving the exploitation phase of generic metaheuristic algorithm. The proposed considers twofold probing mechanism, which takes advantage chaotic number generated by hybrid map composed Logistic Kent to move around so-far-obtained global best solutions reach feasible candidate solutions. Also, an iterative inspired variant differential evolution algorithm is incorporated into manipulation enhance intensification on promising regions. included in well-reputed metaheuristics evolution, crow search, whale optimization, sine–cosine algorithms assess resulting improvements made optimization accuracy. Forty benchmark functions unimodal multimodal test problems have been solved improved basic forms these optimizers identify amelioration terms solution accuracy robustness. Two different real-world constrained analyze improvement qualities maintained utilization method. Furthermore, mentioned along with their applied one-dimensional transient heat conduction obtain accurate temperature distribution across transfer medium. Optimization results reveal that utilizing enhanced can be considered favorable alternative conventional methods solving problems.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving random inverse heat conduction problems using PSO and genetic algorithms

The main purpose of this paper is to solve an inverse random differential equation problem using evolutionary algorithms. Particle Swarm Algorithm and Genetic Algorithm are two algorithms that are used in this paper. In this paper, we solve the inverse problem by solving the inverse random differential equation using Crank-Nicholson's method. Then, using the particle swarm optimization algorith...

متن کامل

Solving multi-objective team orienteering problem with time windows using adjustment iterated local search

One of the problems tourism faces is how to make itineraries more effective and efficient. This research has solved the routing problem with the objective of maximizing the score and minimizing the time needed for the tourist’s itinerary. Maximizing the score means collecting a maximum of various kinds of score from each destination that is visited. The profits differ according to whether those...

متن کامل

A Hybrid Algorithm using Firefly, Genetic, and Local Search Algorithms

In this paper, a hybrid multi-objective algorithm consisting of features of genetic and firefly algorithms is presented. The algorithm starts with a set of fireflies (particles) that are randomly distributed in the solution space; these particles converge to the optimal solution of the problem during the evolutionary stages. Then, a local search plan is presented and implemented for searching s...

متن کامل

A novel computational procedure based on league championship algorithm for solving an inverse heat conduction problem

Inverse heat conduction problems, which are one of the most important groups of problems, are often ill-posed and complicated problems, and their optimization process has lots of local extrema. This paper provides a novel computational procedure based on finite differences method and league championship algorithm to solve a one-dimensional inverse heat conduction problem. At the beginning, we u...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SN applied sciences

سال: 2021

ISSN: ['2523-3971', '2523-3963']

DOI: https://doi.org/10.1007/s42452-020-04065-3